Repulsive surfaces

نویسندگان

چکیده

Functionals that penalize bending or stretching of a surface play key role in geometric and scientific computing, but to date have ignored very basic requirement: many situations, surfaces must not pass through themselves each other. This paper develops numerical framework for optimization geometry while avoiding (self-)collision. The starting point is the tangent-point energy , which effectively pushes apart pairs points are close space distant along surface. We develop discretization this triangle meshes, introduce novel acceleration scheme based on fractional Sobolev inner product. In contrast similar schemes developed curves, we avoid complexity building multiresolution mesh hierarchy by decomposing our preconditioner into two ordinary Poisson equations, plus forward application differential operator. further accelerate via hierarchical approximation, describe how incorporate variety constraints (on area, volume, etc. ). Finally, explore machinery might be applied problems mathematical visualization, modeling, processing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repulsive Mixtures

Discrete mixtures are used routinely in broad sweeping applications ranging from unsupervised settings to fully supervised multi-task learning. Indeed, finite mixtures and infinite mixtures, relying on Dirichlet processes and modifications, have become a standard tool. One important issue that arises in using discrete mixtures is low separation in the components; in particular, different compon...

متن کامل

Repulsive Affinity-Based Clustering

Clustering is a fundamental problem in machine learning that has applications in a wide variety of domains. It is concerned with finding groups of objects that are closely related under some dissimilarity measure. Most current clustering techniques suffer from a fundamental problem: they do not consider the data density between a point and its corresponding cluster center in the evaluation of t...

متن کامل

Repulsive-SVDD Classification

Support vector data description (SVDD) is a well-known kernel method that constructs a minimal hypersphere regarded as a data description for a given data set. However SVDD does not take into account any statistical distribution of the data set in constructing that optimal hypersphere, and SVDD is applied to solving one-class classification problems only. This paper proposes a new approach to S...

متن کامل

Repulsive Dark Matter

It seems necessary to suppress, at least partially, the formation of structure on subgalactic scales. As an alternative to warm or collisional dark matter, I postulate a condensate of massive bosons interacting via a repulsive interparticle potential, plus gravity. This leads to a minimum lengthscale for bound objects, and to superfluidity. Galactic dynamics may differ significantly from that o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Graphics

سال: 2021

ISSN: ['0730-0301', '1557-7368']

DOI: https://doi.org/10.1145/3478513.3480521